Self-organizing Traffic Lights

نویسنده

  • Carlos Gershenson
چکیده

Steering traffic in cities is a very complex task, since improving efficiency involves the coordination of many actors. Traditional approaches attempt to optimize traffic lights for a particular density and configuration of traffic. The disadvantage of this lies in the fact that traffic densities and configurations change constantly. Traffic seems to be an adaptation problem rather than an optimization problem. We propose a simple and feasible alternative, in which traffic lights self-organize to improve traffic flow. We use a multi-agent simulation to study three self-organizing methods, which are able to outperform traditional rigid and adaptive methods. Using simple rules and no direct communication, traffic lights are able to self-organize and adapt to changing traffic conditions, reducing waiting times, number of stopped cars, and increasing average speeds.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-organizing traffic lights: A realistic simulation

We have previously shown in an abstract simulation (Gershenson, 2005) that self-organizing traffic lights can improve greatly traffic flow for any density. In this paper, we extend these results to a realistic setting, implementing self-organizing traffic lights in an advanced traffic simulator using real data from a Brussels avenue. On average, for different traffic densities, travel waiting t...

متن کامل

History-based Self-Organizing Traffic Lights

Managing traffic in cities is nowadays a complex problem involving considerable physical and economical resources. Multi-agent Systems (MAS) consist of a set of distributed, usually co-operating, agents that act autonomously. The traffic in a city can be simulated by a MAS with different agents, cars and traffic lights, that interact to obtain an overall goal: to reduce average waiting times fo...

متن کامل

Modeling self-organizing traffic lights with elementary cellular automata

There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only rules 184, 252, and 136. The simplicity of the model offers a clear understanding of the main properties of city traffic and its phase transitions. We use th...

متن کامل

Self-organizing traffic lights at multiple-street intersections

The elementary cellular automaton following rule 184 can mimic particles flowing in one direction at a constant speed. This automaton can therefore model highway traffic. In a recent paper, we have incorporated intersections regulated by traffic lights to this model using exclusively elementary cellular automata. In such a paper, however, we only explored a rectangular grid. We now extend our m...

متن کامل

Self-Organizing Traffic Lights as an Upper Bound Estimate

Self-organizing traffic lights (SOTL) methodology is highly popular and is the subject of much discussion (e.g., [1–7]). Zhung et al. [1] (based on constructions presented in [2]) claim that by using SOTL “overall better performance and higher capacity can be achieved” in comparison to the systems normally used by traffic authorities. “The idealized control scheme SOTL, which is designed to uni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Complex Systems

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2005